A projective simplex algorithm using LU decomposition
نویسندگان
چکیده
منابع مشابه
Sparse LU Decomposition using FPGA
This paper reports on an FPGA implementation of sparse LU decomposition. The resulting special purpose hardware is geared towards power system problems load flow computation which are typically solved iteratively using Newton Raphson. The key step in this process, which takes approximately 85% of the computation time, is the solution of sparse linear systems arising from the Jacobian matrices t...
متن کاملClassification using Efficient LU Decomposition in Sensornets
We consider the popular application of detection, classification and tracking and their feasibility in resource constrained sensornets. We concentrate on the classification aspect, by decomposing the complex, computationally intensive signal processing Maximum-APosterior (MAP) classifier into simpler computationally and communicationally load balanced procedures, using a clustering approach. LU...
متن کاملPricing American Options Using LU Decomposition
Numerical solution methods for pricing American options are considered. We propose a second-order accurate Runge-Kutta scheme for the time discretization of the Black-Scholes partial differential equation with an early exercise constraint. We reformulate the algorithm introduced by Brennan and Schwartz into a simple form using a LU decomposition and a modified backward substitution with a proje...
متن کاملRandomized LU Decomposition Using Sparse Projections
A fast algorithm for the approximation of a low rank LU decomposition is presented. In order to achieve a low complexity, the algorithm uses sparse random projections combined with FFTbased random projections. The asymptotic approximation error of the algorithm is analyzed and a theoretical error bound is presented. Finally, numerical examples illustrate that for a similar approximation error, ...
متن کاملSolving railway line planning problems using a decomposition algorithm
The passenger line planning is a process of strategic long-term decision-making problem in the field of railway passenger planning. A line is a route between starting point and destination with certain stops, which has a certain frequency of train schedule. A new solution based on decomposition algorithm has been proposed in this paper, which is defined in a master problem and two sub problems....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2000
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(99)00323-5